Complementing Logic Program Semantics
نویسندگان
چکیده
We consider abstract interpretation, and in particular the basic operators of reduced product and complementation of abstract domains, as a tool to systematically derive denotational semantics by composition and decomposition. Reduced product allows to perform the logical conjunction of semantics, while complementation characterizes what is left from a semantics when the information concerning a given observable property is “subtracted” from it. We apply this idea to the case of logic programming, characterizing in a uniform algebraic setting, the interaction between a number of well known declarative semantics for logic programs.
منابع مشابه
Answer Set Programming for the Semantic Web
This thesis makes a contribution to the research e orts of integrating rule-based inference methods with current knowledge representation formalisms in the Semantic Web. Ontology languages such as OWL and RDF Schema seem to be widely accepted and successfully used for semantically enriching knowledge on the Web and thus prepare it for machinereadability. However, these languages are of restrict...
متن کاملLogic Programming in Assumption-Based Argumentation Revisited - Semantics and Graphical Representation
Logic Programming and Argumentation Theory have been existing side by side as two separate, yet related, techniques in the field of Knowledge Representation and Reasoning for many years. When Assumption-Based Argumentation (ABA) was first introduced in the nineties, the authors showed how a logic program can be encoded in an ABA framework and proved that the stable semantics of a logic program ...
متن کاملAbductive logic programming and disjunctive logic programming: their relationship and transferability
Abductive logic programming (ALP) and disjunctive logic programming (DLP) are two different extensions of logic programming. This paper investigates the relationship between ALP and DLP from the program transformation viewpoint. It is shown that the belief set semantics of an abductive program is expressed by the answer set semantics and the possible model semantics of a disjunctive program. In...
متن کاملLogic program semantcs via an argumentation semantics
There are various semantics designed for argumentation frameworks. They enable to assign a meaning e.g. to odd-length cycles. Our main motivation is to transfer semantics proposed by Baroni, Giacomin and Guida for argumentation frameworks with odd-length cycles to logic programs with odd-length cycles through default negation. The developed construction is even stronger. For a given logic progr...
متن کاملRules as Actions: A Situation Calculus Semantics for Logic Programs
We propose a novel semantics for logic programs with negation by viewing the application of a clause in a derivation as an action in the situation calculus. Program clauses are then identiied with situation calculus effect axioms as they are understood in axiomatic theories of actions. We then solve the frame problem for these eeect axioms using a recent approach of Reiter 21], and identify the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996